package ex1;



public class AllUsesCoverage extends EdgeCoverageCases{

	// Test Requirements:
	// Du(0,2,numbers)	--> T2 Handles that
	// Du(0,3,numbers)	--> Not Possible - Loop - Must return through node 2
	// Du(0,5,numbers)  --> Not Possible - Loop - Must return through node 2
	// Du(1,7,count) --> T2 Handles that
	// Du(6,7, count) -- Not possible, Immediate loop (need simple path)
	// Du(2,2,i) --> T2 Handles That
	// Du(2,3,i) --> Not Possible - Loop - Must return through node 2
	// Du(2,5,i) --> Not Possible - Loop - Must return through node 2
	// Du(3,4,x) --> Not Possible - Loop - Must return through node 2
	// Du(3,5,x) --> Not Possible - Loop - Must return through node 2
	
	// As in AllDefs - once you got into Node 3, you will at least once
	// perform a loop to 2. This because, the (5,7) node requires i>0
	// and on the 1st time, i==0 --> Node 5 will go to node 2 (no check of the value) -- LOOP.
	
}
